An inexact primal–dual method with correction step for a saddle point problem in image debluring

نویسندگان

چکیده

In this paper, we present an inexact primal–dual method with correction step for a saddle point problem by introducing the notations of extended proximal operators symmetric positive definite matrix D. Relaxing requirement on sizes, prove convergence proposed method. We also establish O(1/N) rate our in ergodic sense. Moreover, apply to solve TV- $$\hbox {L}_1$$ image deblurring problems. Numerical simulation results illustrate efficiency

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inexact Barzilai-Borwein method for saddle point problems

This paper considers the inexact Barzilai-Borwein algorithm applied to saddle point problems. To this aim, we study the convergence properties of the inexact Barzilai-Borwein algorithm for symmetric positive definite linear systems. Suppose that gk and g̃k are the exact residual and its approximation of the linear system at the k-th iteration, respectively. We prove the R-linear convergence of t...

متن کامل

SADDLE POINT VARIATIONAL METHOD FOR DIRAC CONFINEMENT

A saddle point variational (SPV ) method was applied to the Dirac equation as an example of a fully relativistic equation with both negative and positive energy solutions. The effect of the negative energy states was mitigated by maximizing the energy with respect to a relevant parameter while at the same time minimizing it with respect to another parameter in the wave function. The Cornell pot...

متن کامل

An Inexact Uzawa-Type Iterative Method for Solving Saddle Point Problems

As an extension of the inexact Uzawa algorithm addressed in 1], we propose an improved inexact Uzawa-type iterative method for solving saddle point problems. The convergence rate is given in terms of the rates of the two basic iterations as deened in 1], and it is shown that the new algorithm always converges as long as the two basic iterations converge. A running title: Uzawa algorithm for sad...

متن کامل

Generalized iterative methods for solving double saddle point problem

In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version  of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...

متن کامل

A Modified Preconditioner for Parameterized Inexact Uzawa Method for Indefinite Saddle Point Problems

The preconditioner for parameterized inexact Uzawa methods have been used to solve some indefinite saddle point problems. Firstly, we modify the preconditioner by making it more generalized, then we use theoretical analyses to show that the iteration method converges under certain conditions. Moreover, we discuss the optimal parameter and matrices based on these conditions. Finally, we propose ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Global Optimization

سال: 2022

ISSN: ['1573-2916', '0925-5001']

DOI: https://doi.org/10.1007/s10898-022-01211-6